Enabling Locality-Aware Computations in OpenMP

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enabling locality-aware computations in OpenMP

Locality of computation is key to obtaining high performance on a broad variety of parallel architectures and applications. It is moreover an essential component of strategies for energy-efficient computing. OpenMP is a widely available industry standard for shared memory programming. With the pervasive deployment of multicore computers and the steady growth in core count, a productive programm...

متن کامل

Introducing Locality-Aware Computation into OpenMP

This paper presents our idea to introduce data locality feature into OpenMP. Given the facts that the memory systems are hierarchical while OpenMP is at, we believe that it is important to introduce new features to OpenMP to provide OpenMP programmer capability to manage the data layout and align tasks and data as close as possible in modern architectures. We present the syntax and examples of ...

متن کامل

Enhancing OpenMP With Features for Locality

OpenMP is a set of directives extending Fortran and C which provide a shared memory programming interface for shared-address space machines. However, there are no directives for controlling the locality of data. Such control can critically affect performance on machines which exhibit non-uniform memory access times. In this paper, we present a set of extensions to OpenMP to provide support for ...

متن کامل

Rescheduling for Locality in Sparse Matrix Computations

In modern computer architecture the use of memory hierarchies causes a program's data locality to directly aaect performance. Data locality occurs when a piece of data is still in a cache upon reuse. For dense matrix computations, loop transformations can be used to improve data locality. However, sparse matrix computations have non-aane loop bounds and indirect memory references which prohibit...

متن کامل

Locality-Aware Content Distribution

We present the design and deployment of the Julia locality aware content distribution algorithm. Our novel contributions are locality aware node selection, forming a dynamically changing topology and division of the file into varying length chunks based on locality of the transfer. We present a large scale WAN deployment on over than 250 PlanetLab machines. We show that our technique can improv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Programming

سال: 2010

ISSN: 1058-9244,1875-919X

DOI: 10.1155/2010/185421